/*
 *  Copyright 2009 Advanced Industrial Science and Technology (AIST).
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */

/*! \file
 *  \brief
 */
#pragma once

#include <thrust/iterator/iterator_adaptor.h>
#include <thrust/graph/graph_traits.hpp>

namespace thrust {

template <class Graph, class Vertex, class OutEdgeIter>
struct adjacency_iter;

namespace detail {
  
template <class Graph, class Vertex, class OutEdgeIter>
struct adjacency_iter_base
{
  typedef OutEdgeIter base_iterator;
  typedef Vertex      value_type;
  typedef value_type  reference;
  typedef use_default pointer;
  typedef typename iterator_space<base_iterator>::type space;
  typedef typename iterator_traversal<base_iterator>::type traversal;
  typedef use_default difference;

public:
  typedef typename thrust::experimental::iterator_adaptor<
    adjacency_iter<Graph,Vertex,OutEdgeIter> // Self
  , base_iterator // Base
  , pointer       // Pointer
  , value_type    // Value
  , space         // Space
  , traversal     // Traversal
  , reference     // Reference
  , difference    // Difference
  > type;
};

} // end namespace detail

} // end namespace thrust
